23 research outputs found

    On Keller's conjecture in dimension seven

    Full text link
    A cube tiling of Rd\mathbb{R}^d is a family of pairwise disjoint cubes [0,1)d+T={[0,1)d+t:t∈T}[0,1)^d+T=\{[0,1)^d+t:t\in T\} such that ⋃t∈T([0,1)d+t)=Rd\bigcup_{t\in T}([0,1)^d+t)=\mathbb{R}^d. Two cubes [0,1)d+t[0,1)^d+t, [0,1)d+s[0,1)^d+s are called a twin pair if ∣tjβˆ’sj∣=1|t_j-s_j|=1 for some j∈[d]={1,…,d}j\in [d]=\{1,\ldots, d\} and ti=sit_i=s_i for every i∈[d]βˆ–{j}i\in [d]\setminus \{j\}. In 19301930, Keller conjectured that in every cube tiling of Rd\mathbb{R}^d there is a twin pair. Keller's conjecture is true for dimensions d≀6d\leq 6 and false for all dimensions dβ‰₯8d\geq 8. For d=7d=7 the conjecture is still open. Let x∈Rdx\in \mathbb{R}^d, i∈[d]i\in [d], and let L(T,x,i)L(T,x,i) be the set of all iith coordinates tit_i of vectors t∈Tt\in T such that ([0,1)d+t)∩([0,1]d+x)β‰ βˆ…([0,1)^d+t)\cap ([0,1]^d+x)\neq \emptyset and ti≀xit_i\leq x_i. It is known that if ∣L(T,x,i)βˆ£β‰€2|L(T,x,i)|\leq 2 for some x∈R7x\in \mathbb{R}^7 and every i∈[7]i\in [7] or ∣L(T,x,i)∣β‰₯6|L(T,x,i)|\geq 6 for some x∈R7x\in \mathbb{R}^7 and i∈[7]i\in [7], then Keller's conjecture is true for d=7d=7. In the present paper we show that it is also true for d=7d=7 if ∣L(T,x,i)∣=5|L(T,x,i)|=5 for some x∈R7x\in \mathbb{R}^7 and i∈[7]i\in [7]. Thus, if there is a counterexample to Keller's conjecture in dimension seven, then ∣L(T,x,i)∣∈{3,4}|L(T,x,i)|\in \{3,4\} for some x∈R7x\in \mathbb{R}^7 and i∈[7]i\in [7].Comment: 37 pages, 7 figures. arXiv admin note: substantial text overlap with arXiv:1304.163

    On composition of idempotent functions

    Get PDF

    On the number of neighborly simplices in R^d

    Full text link
    Two dd-dimensional simplices in RdR^d are neighborly if its intersection is a (dβˆ’1)(d-1)-dimensional set. A family of dd-dimensional simplices in RdR^d is called neighborly if every two simplices of the family are neighborly. Let SdS_d be the maximal cardinality of a neighborly family of dd-dimensional simplices in RdR^d. Based on the structure of some codes VβŠ‚{0,1,βˆ—}nV\subset \{0,1,*\}^n it is shown that lim⁑dβ†’βˆž(2d+1βˆ’Sd)=∞\lim_{d\rightarrow \infty}(2^{d+1}-S_d)=\infty. Moreover, a result on the structure of codes VβŠ‚{0,1,βˆ—}nV\subset \{0,1,*\}^n is given
    corecore